Decision diagrams for solving traveling salesman problems with pickup and delivery in real time

The Traveling Salesman Problem with Pickup and Delivery seeks a minimum cost path with pickups preceding deliveries. It is important in on-demand last-mile logistics, such as ride sharing and meal delivery. We examine the use of low-width Decision Diagrams in a branch-and-bound with and without Assignment Problem inference duals as a primal heuristic for finding good solutions within strict time budgets. We show these diagrams can be more effective than similarly structured hybrid Constraint Programming techniques for real-time decision making.     

Optimal time delays in a class of reaction-diffusion equations

ABSTRACT

A class of semilinear parabolic reaction diffusion equations with multiple time delays is considered. These time delays and corresponding weights are to be optimized such that the associated solution of the delay equation is the best approximation of a desired state function. The differentiability of the mapping is proved that associates the solution of the delay equation to the vector of weights and delays. Based on an adjoint calculus, first-order necessary optimality conditions are derived. Numerical test examples show the applicability of the concept of optimizing time delays.     

Persistence of sums of correlated increments and clustering in cellular automata

Let $T$ be the first return time to $(?\infty ,0]$ of sums of increments given by a functional of a stationary Markov chain. We determine the asymptotic behavior of the survival probability, $\mathbb{P}(T\ge t)～C{t}^{?1∕2}$ for an explicit constant $C$. Our analysis is based on a connection between the survival probability and the running maximum of the time-reversed process, and relies on a functional central limit theorem for Markov chains. As applications, we recover known clustering results for the 3-color cyclic cellular automaton and the Greenberg–Hastings model, and we prove a new clustering result for the 3-color firefly cellular automaton.     

Analytical solution of optimal Meixner-like pole

In this paper, we prove the possibility of optimization of some free parameters of Meixner-like discrete-time linear filters using orthonormal basis functions (OBF) in an analytical way. Since the z-transform of the Meixner filters is impossible and it is possible for Meixner-like filters, we are motivated to study closely the optimization of the Meixner-like's pole. As a result, the differential equation associated with Meixner-like filters has been developed. On the other hand, the effective width of the energy distribution in the transformation domain is a function of the free parameter (Meixner-like pole) and simple signal measurements and can be calculated by the second-order moment. Analytic minimization of the second-order moment gives an optimal value of the free parameter. To validate the effectiveness of the proposed approach, numerical results are used to determine the free parameters.     

云制造平台加工能力分享调度优化研究

云制造平台加工能力分享的调度优化是云制造模式的核心运营问题。为提高云制造平台对参与能力分享企业资源的利用率,解决实际云制造需求环境下企业级制造资源调度问题,达到云制造平台动态实时的要求,以最小化工期和成本为目标函数,构建了基于平台并面向分享的云加工能力调度模型。为快速求解多个云任务订单的最优调度序列,引入任务简易编码和随机权重,设计了改进的二阶粒子群算法,并提出可分享加工能力时间窗的更新策略。最后,通过算例验证云制造平台加工能力调度机制的可行性和有效性。     

Preparation of free‐standing silicone particles in aqueous heterogeneous system

To prepare cross‐linked silicone (silicone rubber) particles in an aqueous medium, we investigated two synthesis methods involving a miniemulsion system. The first method was based on cationic ring‐opening polymerization of cyclic siloxane, which is a common synthetic route for linear silicone oil and uses octamethylcyclotetrasiloxane (D₄) as the monomer and dimeric D₄ (bis‐D₄) as the cross‐linker. Although this method produces silicone particles, the particles do not remain in the particulate state after drying because of low cross‐linking density. The polymerization mechanism of this method was also investigated, which proceeds under the ring‐opening reaction of D₄ in monomer droplets and upon polycondensation of hydrolyzed D₄, which occurs in the water phase (ie, outside the monomer droplets). This mechanism implied that introducing the cross‐linking structure into particles is difficult because of the low solubility of bis‐D₄ in water. To overcome these difficulties, we demonstrated a second method of preparing silicone particles based on the thiol‐Michael addition reaction between thiol‐terminated silicone oil and triacrylate in miniemulsion systems. Transmission electron microscopy images indicated that the silicone particles obtained in the particulate state upon drying and the aggregates of these particles showed elasticity.     

Going Off the Grid: Iterative Model Selection for Biclustered Matrix Completion

We consider the problem of performing matrix completion with side information on row-by-row and column-by-column similarities. We build upon recent proposals for matrix estimation with smoothness constraints with respect to row and column graphs. We present a novel iterative procedure for directly minimizing an information criterion to select an appropriate amount of row and column smoothing, namely, to perform model selection. We also discuss how to exploit the special structure of the problem to scale up the estimation and model selection procedure via the Hutchinson estimator, combined with a stochastic Quasi-Newton approach. Supplementary material for this article is available online.     

差异化需求下考虑患者预约行为的医疗服务供需匹配方法

如何根据患者的差异化需求,撮合医生与患者双方形成合理有效的医疗服务供需匹配,是医疗服务运作管理中重要的研究问题。本文针对医疗服务中医生与患者的实际需求,提出了一种考虑患者预约行为的匹配决策方法。在该方法中,首先依据患者的预约行为及特征分类;然后,通过计算不同情形下医患双方的差异度,获得了医患双方的满意度矩阵;在此基础上,提出了匹配预约患者与医生的E-HR算法,并进一步构建了匹配剩余患者和医生的多目标优化模型,通过模型求解得到最优匹配结果;最后,通过算例说明了本文提出方法的可行性和实用性。